0.00/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.10	% Command    : run_E %s %d THM
0.10/0.30	% Computer : n013.cluster.edu
0.10/0.30	% Model    : x86_64 x86_64
0.10/0.30	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.30	% Memory   : 8042.1875MB
0.10/0.30	% OS       : Linux 3.10.0-693.el7.x86_64
0.10/0.30	% CPULimit   : 960
0.10/0.30	% WCLimit    : 120
0.10/0.30	% DateTime   : Tue Aug  9 02:09:30 EDT 2022
0.10/0.30	% CPUTime    : 
0.14/0.40	Running higher-order on 8 cores theorem proving
0.14/0.40	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.14/0.40	# Version: 3.0pre003-ho
0.14/0.41	# Preprocessing class: HSSSSMSSMLSNHSN.
0.14/0.41	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.14/0.41	# Starting new_ho_9 with 600s (5) cores
0.14/0.41	# Starting post_as_ho1 with 120s (1) cores
0.14/0.41	# Starting sh1l with 120s (1) cores
0.14/0.41	# Starting post_as_ho10 with 120s (1) cores
0.14/0.41	# post_as_ho10 with pid 3250 completed with status 0
0.14/0.41	# Result found by post_as_ho10
0.14/0.41	# Preprocessing class: HSSSSMSSMLSNHSN.
0.14/0.41	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.14/0.41	# Starting new_ho_9 with 600s (5) cores
0.14/0.41	# Starting post_as_ho1 with 120s (1) cores
0.14/0.41	# Starting sh1l with 120s (1) cores
0.14/0.41	# Starting post_as_ho10 with 120s (1) cores
0.14/0.41	# No SInE strategy applied
0.14/0.41	# Search class: HGHNF-FFSM00-SHSSMFNN
0.14/0.41	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.14/0.41	# Starting new_ho_10 with 65s (1) cores
0.14/0.41	# new_ho_10 with pid 3255 completed with status 0
0.14/0.41	# Result found by new_ho_10
0.14/0.41	# Preprocessing class: HSSSSMSSMLSNHSN.
0.14/0.41	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.14/0.41	# Starting new_ho_9 with 600s (5) cores
0.14/0.41	# Starting post_as_ho1 with 120s (1) cores
0.14/0.41	# Starting sh1l with 120s (1) cores
0.14/0.41	# Starting post_as_ho10 with 120s (1) cores
0.14/0.41	# No SInE strategy applied
0.14/0.41	# Search class: HGHNF-FFSM00-SHSSMFNN
0.14/0.41	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.14/0.41	# Starting new_ho_10 with 65s (1) cores
0.14/0.41	# Preprocessing time       : 0.001 s
0.14/0.41	# Presaturation interreduction done
0.14/0.41	
0.14/0.41	# Proof found!
0.14/0.41	# SZS status Theorem
0.14/0.41	# SZS output start CNFRefutation
0.14/0.41	thf(decl_22, type, mrel: mworld > mworld > $o).
0.14/0.41	thf(decl_23, type, mactual: mworld).
0.14/0.41	thf(decl_24, type, mlocal: (mworld > $o) > $o).
0.14/0.41	thf(decl_25, type, mnot: (mworld > $o) > mworld > $o).
0.14/0.41	thf(decl_26, type, mand: (mworld > $o) > (mworld > $o) > mworld > $o).
0.14/0.41	thf(decl_27, type, mor: (mworld > $o) > (mworld > $o) > mworld > $o).
0.14/0.41	thf(decl_28, type, mimplies: (mworld > $o) > (mworld > $o) > mworld > $o).
0.14/0.41	thf(decl_29, type, mequiv: (mworld > $o) > (mworld > $o) > mworld > $o).
0.14/0.41	thf(decl_30, type, mbox: (mworld > $o) > mworld > $o).
0.14/0.41	thf(decl_31, type, mdia: (mworld > $o) > mworld > $o).
0.14/0.41	thf(decl_32, type, p: mworld > $o).
0.14/0.41	thf(decl_33, type, esk1_0: mworld).
0.14/0.41	thf(decl_34, type, esk2_0: mworld).
0.14/0.41	thf(mlocal_def, axiom, ((mlocal)=(^[X1:mworld > $o]:((X1 @ mactual)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mlocal_def)).
0.14/0.41	thf(mnot_def, axiom, ((mnot)=(^[X2:mworld > $o, X3:mworld]:(~((X2 @ X3))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mnot_def)).
0.14/0.41	thf(mimplies_def, axiom, ((mimplies)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)=>(X4 @ X3))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mimplies_def)).
0.14/0.41	thf(mequiv_def, axiom, ((mequiv)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)<=>(X4 @ X3))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mequiv_def)).
0.14/0.41	thf(mbox_def, axiom, ((mbox)=(^[X1:mworld > $o, X3:mworld]:(![X5:mworld]:(((mrel @ X3 @ X5)=>(X1 @ X5)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mbox_def)).
0.14/0.41	thf(mdia_def, axiom, ((mdia)=(^[X1:mworld > $o, X3:mworld]:(?[X5:mworld]:(((mrel @ X3 @ X5)&(X1 @ X5)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mdia_def)).
0.14/0.41	thf(con, conjecture, (mlocal @ (mequiv @ (mbox @ (mimplies @ p @ (mnot @ p))) @ (mnot @ (mdia @ p)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', con)).
0.14/0.41	thf(c_0_7, plain, ((mlocal)=(^[Z0:mworld > $o]:((Z0 @ mactual)))), inference(fof_simplification,[status(thm)],[mlocal_def])).
0.14/0.41	thf(c_0_8, plain, ((mnot)=(^[Z0:mworld > $o, Z1:mworld]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot_def])).
0.14/0.41	thf(c_0_9, plain, ((mimplies)=(^[Z0:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)=>(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies_def])).
0.14/0.41	thf(c_0_10, plain, ((mequiv)=(^[Z0:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)<=>(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mequiv_def])).
0.14/0.41	thf(c_0_11, plain, ((mbox)=(^[Z0:mworld > $o, Z1:mworld]:(![X5:mworld]:(((mrel @ Z1 @ X5)=>(Z0 @ X5)))))), inference(fof_simplification,[status(thm)],[mbox_def])).
0.14/0.41	thf(c_0_12, plain, ((mdia)=(^[Z0:mworld > $o, Z1:mworld]:(?[X5:mworld]:(((mrel @ Z1 @ X5)&(Z0 @ X5)))))), inference(fof_simplification,[status(thm)],[mdia_def])).
0.14/0.41	thf(c_0_13, negated_conjecture, ~((![X7:mworld]:(((mrel @ mactual @ X7)=>((p @ X7)=>~(p @ X7))))<=>~(?[X8:mworld]:(((mrel @ mactual @ X8)&(p @ X8)))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[con]), c_0_7]), c_0_8]), c_0_9]), c_0_10]), c_0_11]), c_0_12])])).
0.14/0.41	thf(c_0_14, negated_conjecture, ![X12:mworld, X13:mworld]:((((((mrel @ mactual @ esk2_0)|(mrel @ mactual @ esk1_0))&((p @ esk2_0)|(mrel @ mactual @ esk1_0)))&((((mrel @ mactual @ esk2_0)|(p @ esk1_0))&((p @ esk2_0)|(p @ esk1_0)))&(((mrel @ mactual @ esk2_0)|(p @ esk1_0))&((p @ esk2_0)|(p @ esk1_0)))))&(~(mrel @ mactual @ X12)|(~(p @ X12)|~(p @ X12))|(~(mrel @ mactual @ X13)|~(p @ X13))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])])).
0.14/0.41	thf(c_0_15, negated_conjecture, ![X3:mworld, X5:mworld]:((~((mrel @ mactual @ X3))|~((p @ X3))|~((p @ X3))|~((mrel @ mactual @ X5))|~((p @ X5)))), inference(split_conjunct,[status(thm)],[c_0_14])).
0.14/0.41	thf(c_0_16, negated_conjecture, ![X5:mworld, X3:mworld]:((~((p @ X5))|~((p @ X3))|~((mrel @ mactual @ X5))|~((mrel @ mactual @ X3)))), inference(cn,[status(thm)],[c_0_15])).
0.14/0.41	thf(c_0_17, negated_conjecture, ![X3:mworld]:((~((mrel @ mactual @ X3))|~((p @ X3)))), inference(condense,[status(thm)],[c_0_16])).
0.14/0.41	thf(c_0_18, negated_conjecture, ((mrel @ mactual @ esk2_0)|(p @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_14])).
0.14/0.41	thf(c_0_19, negated_conjecture, ((p @ esk2_0)|(p @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_14])).
0.14/0.41	thf(c_0_20, negated_conjecture, ((p @ esk2_0)|(mrel @ mactual @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_14])).
0.14/0.41	thf(c_0_21, negated_conjecture, (p @ esk1_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_19])).
0.14/0.41	thf(c_0_22, negated_conjecture, ((mrel @ mactual @ esk2_0)|(mrel @ mactual @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_14])).
0.14/0.41	thf(c_0_23, negated_conjecture, (p @ esk2_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_20]), c_0_21])])).
0.14/0.41	thf(c_0_24, negated_conjecture, (mrel @ mactual @ esk1_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_22]), c_0_23])])).
0.14/0.41	thf(c_0_25, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_24]), c_0_21])]), ['proof']).
0.14/0.41	# SZS output end CNFRefutation
0.14/0.41	# Parsed axioms                        : 22
0.14/0.41	# Removed by relevancy pruning/SinE    : 0
0.14/0.41	# Initial clauses                      : 20
0.14/0.41	# Removed in clause preprocessing      : 12
0.14/0.41	# Initial clauses in saturation        : 8
0.14/0.41	# Processed clauses                    : 18
0.14/0.41	# ...of these trivial                  : 0
0.14/0.41	# ...subsumed                          : 2
0.14/0.41	# ...remaining for further processing  : 16
0.14/0.41	# Other redundant clauses eliminated   : 0
0.14/0.41	# Clauses deleted for lack of memory   : 0
0.14/0.41	# Backward-subsumed                    : 0
0.14/0.41	# Backward-rewritten                   : 4
0.14/0.41	# Generated clauses                    : 5
0.14/0.41	# ...of the previous two non-redundant : 4
0.14/0.41	# ...aggressively subsumed             : 0
0.14/0.41	# Contextual simplify-reflections      : 1
0.14/0.41	# Paramodulations                      : 5
0.14/0.41	# Factorizations                       : 0
0.14/0.41	# NegExts                              : 0
0.14/0.41	# Equation resolutions                 : 0
0.14/0.41	# Propositional unsat checks           : 0
0.14/0.41	#    Propositional check models        : 0
0.14/0.41	#    Propositional check unsatisfiable : 0
0.14/0.41	#    Propositional clauses             : 0
0.14/0.41	#    Propositional clauses after purity: 0
0.14/0.41	#    Propositional unsat core size     : 0
0.14/0.41	#    Propositional preprocessing time  : 0.000
0.14/0.41	#    Propositional encoding time       : 0.000
0.14/0.41	#    Propositional solver time         : 0.000
0.14/0.41	#    Success case prop preproc time    : 0.000
0.14/0.41	#    Success case prop encoding time   : 0.000
0.14/0.41	#    Success case prop solver time     : 0.000
0.14/0.41	# Current number of processed clauses  : 6
0.14/0.41	#    Positive orientable unit clauses  : 4
0.14/0.41	#    Positive unorientable unit clauses: 0
0.14/0.41	#    Negative unit clauses             : 1
0.14/0.41	#    Non-unit-clauses                  : 1
0.14/0.41	# Current number of unprocessed clauses: 0
0.14/0.41	# ...number of literals in the above   : 0
0.14/0.41	# Current number of archived formulas  : 0
0.14/0.41	# Current number of archived clauses   : 10
0.14/0.41	# Clause-clause subsumption calls (NU) : 6
0.14/0.41	# Rec. Clause-clause subsumption calls : 6
0.14/0.41	# Non-unit clause-clause subsumptions  : 4
0.14/0.41	# Unit Clause-clause subsumption calls : 4
0.14/0.41	# Rewrite failures with RHS unbound    : 0
0.14/0.41	# BW rewrite match attempts            : 5
0.14/0.41	# BW rewrite match successes           : 3
0.14/0.41	# Condensation attempts                : 18
0.14/0.41	# Condensation successes               : 1
0.14/0.41	# Termbank termtop insertions          : 984
0.14/0.41	
0.14/0.41	# -------------------------------------------------
0.14/0.41	# User time                : 0.004 s
0.14/0.41	# System time              : 0.001 s
0.14/0.41	# Total time               : 0.005 s
0.14/0.41	# Maximum resident set size: 1776 pages
0.14/0.41	
0.14/0.41	# -------------------------------------------------
0.14/0.41	# User time                : 0.004 s
0.14/0.41	# System time              : 0.003 s
0.14/0.41	# Total time               : 0.007 s
0.14/0.41	# Maximum resident set size: 1732 pages
0.14/0.41	EOF